منابع مشابه
A Fully Dynamic Algorithm for Planar Width
We show how to maintain the width of a set of n planar points subje t to insertions and deletions of points in O(pn log3 n) amortized time per update. Previously, no fully dynami algorithm with a guaranteed sublinear time bound was known.
متن کاملA Fully Dynamic Algorithm for Maintaining theTransitive
This paper presents an eecient fully dynamic graph algorithm for maintaining the transitive closure of a directed graph. The algorithm updates the adjacency matrix of the transitive closure with each update to the graph. Hence, each reachability query of the form \Is there a directed path from i to j?" can be answered in O(1) time. The algorithm is randomized; it is correct when answering yes, ...
متن کاملA Faster Algorithm for Fully Dynamic Betweenness Centrality
We present a new fully dynamic algorithm for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν · log n) time per update, where n = |V | and ν bounds the number of distinct edges that lie on shortest paths through any single vertex. This...
متن کاملA Fully Dynamic Algorithm for Distributed Shortest Paths
We propose a fully-dynamic distributed algorithm for the all-pairs shortest paths problem on general networks with positive real edge weights. If ∆σ is the number of pairs of nodes changing the distance after a single edge modification σ (insert, delete, weight decrease, or weight increase) then the message complexity of the proposed algorithm is O(n∆σ) in the worst case, where n is the number ...
متن کاملFully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract)
We present the rst data structure to maintain an embedded planar graph under arbitrary edge insertions, arbitrary edge deletions and queries that test whether the insertion of a new edge would violate the planarity of the embedding. Our data structure supports online updates and queries on an n{vertex embedded planar graph in O(log 2 n) worst{case time, it can be built in O(n) time and requires...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2003
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-003-2923-8